N Due Date on Parallel and Identical
نویسندگان
چکیده
We propose a heuristic procedure that constructs a schedule for N jobs with stochastic processing times and a common due date on M parallel, identical machines. The criterion is the minimization of the total expected incompletion cost. A worst-case analysis for the ratio of the heuristic and optimal solutions is presented and a bound on the ratio is derived. The experimental results presented indicate that the heuristic procedure generates almost optimal solutions.
منابع مشابه
A bi-objective model for a scheduling problem of unrelated parallel batch processing machines with fuzzy parameters by two fuzzy multi-objective meta-heuristics
This paper considers a bi-objective model for a scheduling problem of unrelated parallel batch processing machines to minimize the makespan and maximum tardiness, simultaneously. Each job has a specific size and the data corresponding to its ready time, due date and processing time-dependent machine are uncertain and determined by trapezoidal fuzzy numbers. Each machine has a specific capacity,...
متن کاملA Novel Approach to the Common Due-Date Problem on Single and Parallel Machines
This chapter presents a novel idea for the general case of the Common Due-Date (CDD) scheduling problem. The problem is about scheduling a certain number of jobs on a single or parallel machines where all the jobs possess different processing times but a common due-date. The objective of the problem is to minimize the total penalty incurred due to earliness or tardiness of the job completions. ...
متن کاملDue-date assignment and parallel-machine scheduling with deteriorating jobs
In this paper we study the problem of scheduling n deteriorating jobs on m identical parallel machines. Each job’s processing time is a nondecreasing function of its start time. The problem is to determine an optimal combination of the due-date and schedule so as to minimize the sum of the due-date, earliness and tardiness penalties. We show that this problem is NP-hard, and we present a heuris...
متن کاملKinematic Mapping and Forward Kinematic Problem of a 5-DOF (3T2R) Parallel Mechanism with Identical Limb Structures
The main objective of this paper is to study the Euclidean displacement of a 5-DOF parallel mechanism performing three translation and two independent rotations with identical limb structures-recently revealed by performing the type synthesis-in a higher dimensional projective space, rather than relying on classical recipes, such as Cartesian coordinates and Euler angles. In this paper, Study's...
متن کاملA New ILP Model for Identical Parallel-Machine Scheduling with Family Setup Times Minimizing the Total Weighted Flow Time by a Genetic Algorithm
This paper presents a novel, integer-linear programming (ILP) model for an identical parallel-machine scheduling problem with family setup times that minimizes the total weighted flow time (TWFT). Some researchers have addressed parallel-machine scheduling problems in the literature over the last three decades. However, the existing studies have been limited to the research of independent jobs,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005